The Suffix Tree of a Tree and Minimizing Sequential Transducers

This paper gives a linear-time algorithm for the construction of thesuffix tree of a tree. The suffix tree of a tree is used to obtain an efficientalgorithm for the minimization of sequential transducers

On Competitive On-Line Paging with Lookahead

This paper studies two methods for improving the competitive efficiency of on-line paging algorithms: in the first, the on-line algorithm canuse more pages; in the second, it is allowed to have a look-ahead, or inother words, some partial knowledge of the future. The paper considers anew measure for the look-ahead size as well as Young's resource-boundedlook-ahead and proves that both measures have the attractive propertythat the competitive efficiency of an on-line algorithm with k extra pagesand look-ahead l depends on k+l. Hence, under these measures, an on-linealgorithm has the same benefit from using an extra page or knowing anextra bit of the future

Efficient String Matching on Coded Texts

The so called "four Russians technique'' is often used to speed up algorithms by encoding several data items in a single memory cell. Given a sequence of n symbols over a constant size alphabet, one can encode the sequence into O(n / lambda) memory cells in O(log(lambda) ) time using n / log(lambda) processors. This paper presents an efficient CRCW-PRAM string-matching algorithm for coded texts that takes O(log log(m/lambda)) time making only O(n / lambda ) operations, an improvement by a factor of lambda = O(log n) on the number of operations used in previous algorithms. Using this string-matching algorithm one can test if a string is square-free and find all palindromes in a string in O(log log n) time using n / log log n processors

Optimal Parallel Construction of Minimal Suffix and Factor Automata

This paper gives optimal parallel algorithms for the construction of the smallest deterministic finite automata recognizing all the suffixes and the factors of a string. The algorithms use recently discovered optimal parallel suffix tree construction algorithms together with data structures for the efficient manipulation of trees, exploiting the well known relation between suffix and factor automata and suffix trees

Dictionary-matching on unbounded alphabets : uniform length dictionaries

Résumé disponible dans les fichiers attaché

Transforming Comparison Model Lower Bounds to the PRAM

This note provides general transformations of lower bounds in Valiant'sparallel comparison decision tree model to lower bounds in the priorityconcurrent-read concurrent-write parallel-random-access-machine model.The proofs rely on standard Ramsey-theoretic arguments that simplifythe structure of the computation by restricting the input domain. Thetransformation of comparison model lower bounds, which are usually easierto obtain, to the parallel-random-access-machine, unifies some knownlower bounds and gives new lower bounds for several problems